Another Look at Dorian Shainin’s Variable Search Technique
نویسندگان
چکیده
An in-depth analysis of Dorian Shainin’s variable search (VS) method is carried out. Conditions under which the VS approach does and does not work well in comparison to traditional designs are identified. Explicit expressions for the expected number of runs and the probability of correct screening are derived under stated assumptions. The crucial roles of process knowledge and noise variation in successful application of the VS design are established through theoretical and simulation studies.
منابع مشابه
Robust Constraint Solving Using Multiple Heuristics
Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a good algorithm for one problem class can be very poor for another; even within the same class performance can vary wildly from one instance to another. CP could be easier to use if we could design robust algorithms that perform ...
متن کاملLook-Ahead Value Ordering for Constraint Satisfaction Problems
Looking ahead during search is often useful when solving constraint satisfaction problems. Previous studies have shown that looking ahead helps by causing dead-ends to occur earlier in the search, and by providing information that is useful for dynamic variable ordering. In this paper, we show that another bene t of looking ahead is a useful domain value ordering heuristic, which we call look-a...
متن کاملDynamic Variable Filtering for Hard Random 3-SAT Problems
The DPL (Davis-Putnam-Logemann-Loveland) procedure is one of the most effective methods for solving SAT problems. It is well known that its efficiency depends on the choice of the branching rule. One of the main improvements of this decision procedure has been the development of better branching variable selection through the use of unit propagation look-ahead (UPLA) heuristics (e.g., [13]). UP...
متن کاملDiscovery Mode Search Techniques For Gamma-Ray Telescopes
Like many wide field gamma-ray telescopes, the Milagro observatory has a highly variable point spread function (PSF), dependent upon the characteristics of the incoming photon. Because of the large variations in the PSF, a binned transient search technique is not optimal, and maximum likelihood can be computationally unfeasible. I have expanded upon the Gaussian weighting technique [1] to devel...
متن کاملConflict-Directed Backjumping Revisited
In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classiied as look-ahead schemes and look-back schemes. Unfortunately , look-ahead and look-back schemes are not entirely orthogonal as it has been observed empirically that the enhancement of look-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011